منابع مشابه
C-Planarity of Embedded Cyclic c-Graphs
We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without crea...
متن کاملC-Planarity of C-Connected Clustered Graphs
We present the first characterization of c-planarity for c-connected clustered graphs. The characterization is based on the interplay between the hierarchy of the clusters and the hierarchies of the triconnected and biconnected components of the underlying graph. Based on such a characterization, we provide a linear-time c-planarity testing and embedding algorithm for c-connected clustered grap...
متن کاملAdvances on Testing C-Planarity of Embedded Flat Clustered Graphs
We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.
متن کاملClustered Graphs and C-planarity
In this paper, we introduce a new graph model known as clustered graphs, i.e. graphs with recursive clustering structures. This graph model has many applications in informational and mathematical sciences. In particular, we study C-planarity of clustered graphs. Given a clustered graph, the C-planarity testing problem is to determine whether the clustered graph can be drawn without edge crossin...
متن کاملC-Planarity of C-Connected Clustered Graphs Part I – Characterization
We present a characterization of the c-planarity of c-connected clustered graphs. The characterization is based on the interplay between the hierarchy of the clusters and the hierarchy of the triconnected and biconnected components of the graph underlying the clustered graph. In a companion paper [2] we exploit such a characterization to give a linear time c-planarity testing and embedding algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2017.06.016